Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Improved algorithms for group testing with inhibitorsDE BONIS, A; VACCARO, U.Information processing letters. 1998, Vol 67, Num 2, pp 57-64, issn 0020-0190Article

Bounding the power of preemption in randomized schedulingCANETTI, R; IRANI, S.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 993-1015, issn 0097-5397Article

Randomized online multi-threaded pagingSEIDEN, S. S.Lecture notes in computer science. 1998, pp 264-275, issn 0302-9743, isbn 3-540-64682-5Conference Paper

Periodic graphs and connectivity of the rational digital hyperplanesGERARD, Yan.Theoretical computer science. 2002, Vol 283, Num 1, pp 171-182, issn 0304-3975Conference Paper

Improved derandomization of BPP using a hitting set generatorGOLDREICH, O; WIGDERSON, A.Lecture notes in computer science. 1999, pp 131-137, issn 0302-9743, isbn 3-540-66329-0Conference Paper

Efficient self-embedding of butterfly networks with random faultsTAMAKI, H.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 614-636, issn 0097-5397Article

A survey of randomness and parallelism in comparison problemsKRIZANC, D.Lecture notes in computer science. 1998, pp 324-329, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Randomized parallel prefetching and buffer managementVARMAN, P. J.Lecture notes in computer science. 1998, pp 363-372, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Maximizing the area of overlap of two unions of disks under rigid motionDE BERG, Mark; CABELLO, Sergio; GIANNOPOULOS, Panos et al.Lecture notes in computer science. 2004, pp 138-149, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Capturing an Evader in a Building : Computational geometry in navigation and path planningSUZUKI, Ichiro; ZYLINSKI, Pawel.IEEE robotics & automation magazine. 2008, Vol 15, Num 2, pp 16-26, issn 1070-9932, 11 p.Article

Finding real-valued single-source shortest paths in o(n³) expected timeKOLLIOPOULOS, S. G; STEIN, C.Journal of algorithms (Print). 1998, Vol 28, Num 1, pp 125-141, issn 0196-6774Article

Improved lower bound for deterministic broadcasting in radio networksFISCH BRITO, Carlos; VAYA, Shailesh.Theoretical computer science. 2011, Vol 412, Num 29, pp 3568-3578, issn 0304-3975, 11 p.Article

Exploring an unknown graph efficientlyFLEISCHER, Rudolf; TRIPPEN, Gerhard.Lecture notes in computer science. 2005, pp 11-22, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Simultaneous multiobjective multiple route selection using genetic algorithm for car navigationCHAKRABORTY, Basabi.Lecture notes in computer science. 2005, pp 696-701, issn 0302-9743, isbn 3-540-30506-8, 1Vol, 6 p.Conference Paper

On gossip codes and traceability schemesVEERUBHOTLA, Ravi S; SAXENA, Ashutosh; GULATI, Ved P et al.International conference on information technology. 2004, pp vol1.772-vol1.777, isbn 0-7695-2108-8, 2VolConference Paper

Cross-over composition: Enforcement of fairness under unfair adversaryBEAUQUIER, Joffroy; GRADINARIU, Maria; JOHNEN, Colette et al.Lecture notes in computer science. 2001, pp 19-34, issn 0302-9743, isbn 3-540-42653-1Conference Paper

Efficient merging, construction, and maintenance of evolutionary treesLINGAS, A; OLSSON, H; ÖSTLIN, A et al.Lecture notes in computer science. 1999, pp 544-553, issn 0302-9743, isbn 3-540-66224-3Conference Paper

Rounding Voronoi diagramDEVILLERS, O; GANDOIN, P.-M.Lecture notes in computer science. 1999, pp 375-387, issn 0302-9743, isbn 3-540-65685-5Conference Paper

A constant time optimal parallel algorithm for two-dimensional pattern matchingCROCHEMORE, M; GASIENIEC, L; HARIHARAN, R et al.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 668-681, issn 0097-5397Article

Randomized data structures for the dynamic closest-pair problemGOLIN, M; RAMAN, R; SCHWARZ, C et al.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 1036-1072, issn 0097-5397Article

Solving fundamental problems on sparse-meshesSIBEYN, J. F.Lecture notes in computer science. 1998, pp 288-299, issn 0302-9743, isbn 3-540-64682-5Conference Paper

Practical Aurifeuillian factorizationALLOMBERT, Bill; BELABAS, Karim.Journal de théorie des nombres de Bordeaux. 2008, Vol 20, Num 3, pp 543-553, issn 1246-7405, 11 p.Article

Deterministic extractors for small-space sourcesKAMO, Jesse; RAO, Anup; VADHAN, Salil et al.Annual ACM symposium on theory of computing. 2006, pp 691-700, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Distributed almost exact approximations for minor-closed familiesCZYGRINOW, Andrzej; HANCKOWIAK, Michal.Lecture notes in computer science. 2006, pp 244-255, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper